implementation *1200

Please click on ads to support us..

Python Code:

if __name__ == "__main__":
        
    f = open("input.txt", "r")
    n = int(f.readline())
    students = list(f.readline())

    f = open("output.txt", "w")
    for i in range(int(n/2)):

        if i + int(n/2) <= n:
            a = students[i]
            b = students[i + int(n/2)]
            arr = [[i + 1, a], [i + int(n/2) + 1, b]]
            arr.sort(key=lambda x: x[1])
                        print(arr[0][0], arr[1][0], file=f)
        else:
            a = students[i]
            b = students[i - int(n/2)]
            arr = [[i + 1, a], [i - int(n/2) - 1, b]]
            arr.sort(key=lambda x: x[1])
                        print(arr[0][0], arr[1][0], file=f)


Comments

Submit
0 Comments
More Questions

14B - Young Photographer
143A - Help Vasilisa the Wise 2
320A - Magic Numbers
1658A - Marin and Photoshoot
514A - Chewbaсca and Number
382A - Ksenia and Pan Scales
734B - Anton and Digits
1080A - Petya and Origami
1642D - Repetitions Decoding
1440A - Buy the String
1658F - Juju and Binary String
478A - Initial Bet
981A - Antipalindrome
365A - Good Number
1204B - Mislove Has Lost an Array
1409D - Decrease the Sum of Digits
1476E - Pattern Matching
1107A - Digits Sequence Dividing
1348A - Phoenix and Balance
1343B - Balanced Array
1186A - Vus the Cossack and a Contest
1494A - ABC String
1606A - AB Balance
1658C - Shinju and the Lost Permutation
1547C - Pair Programming
550A - Two Substrings
797B - Odd sum
1093A - Dice Rolling
1360B - Honest Coach
1399C - Boats Competition